Lazy skip-lists: An algorithm for fast hybridization-expansion quantum Monte Carlo
نویسندگان
چکیده
منابع مشابه
Lazy skip-lists: An algorithm for fast hybridization-expansion quantum Monte Carlo
The solution of a generalized impurity model lies at the heart of electronic structure calculations with dynamical mean field theory. In the strongly correlated regime, the method of choice for solving the impurity model is the hybridization-expansion continuous-time quantum Monte Carlo (CT-HYB). Enhancements to the CT-HYB algorithm are critical for bringing new physical regimes within reach of...
متن کاملAn evolutionary Monte Carlo algorithm for predicting DNA hybridization
Many DNA-based technologies, such as DNA computing, DNA nanoassembly and DNA biochips, rely on DNA hybridization reactions. Previous hybridization models have focused on macroscopic reactions between two DNA strands at the sequence level. Here, we propose a novel population-based Monte Carlo algorithm that simulates a microscopic model of reacting DNA molecules. The algorithm uses two essential...
متن کاملStochastic Series Expansion Quantum Monte Carlo
This Chapter outlines the fundamental construction of the Stochastic Series Expansion, a highly efficient and easily implementable quantum Monte Carlo method for quantum lattice models. Originally devised as a finite-temperature simulation based on a Taylor expansion of the partition function, the method has recently been recast in the formalism of a zero-temperature projector method, where a l...
متن کاملQuantum algorithm for exact Monte Carlo sampling.
We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.
متن کاملAnalysis of an Optimized Search Algorithm for Skip Lists
It was suggested in Pugh (1990) to avoid redundant key comparisons in the skip list search algorithm by marking those elements whose key has already been compared against the search key. We present here a precise analysis of the total search cost (expectation and variance), where the cost of the search is measured in terms of the number of key-to-key comparisons. These results are then compared...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2014
ISSN: 1098-0121,1550-235X
DOI: 10.1103/physrevb.90.075149